finite alphabet - перевод на русский
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

finite alphabet - перевод на русский

COVER OF A SET
Point finite; Point-finite; Point finite collection
Найдено результатов: 549
finite alphabet      

математика

конечный алфавит

finite alphabet      
конечный алфавит
input symbol         
NON-EMPTY SET OF SYMBOLS OR LETTERS IN COMPUTER SCIENCE AND MATHEMATICAL LOGIC
Input symbol; Alphabet (computer science); Alphabet (mathematics); Character alphabet

математика

входной символ

Roman alphabet         
  • alt=Duenos inscription
  • shrine of the Augustales]] at [[Herculaneum]].
  • ''De chalcographiae inventione'' (1541, [[Mainz]]) with the 23 letters. [[J]], [[U]] and [[W]] are missing.
  • 1553}}
ALPHABET USED TO WRITE THE LATIN LANGUAGE (MORE SPECIFIC THAN Q8229: LATIN ALPHABET)
Roman alphabet; Latin Alphabet; Latin-alphabet; Roman Alphabet; Latin (alphabet); Rome alphabet; Classical Latin alphabet; Early Latin alphabet; Abcdefghijklmnopqrstuvwxyz; Roman-alphabet; ABCDEFGHIJKLMNOPQRSTUVWXYZ; Old Latin alphabet
латинский алфавит
roman alphabet         
  • alt=Duenos inscription
  • shrine of the Augustales]] at [[Herculaneum]].
  • ''De chalcographiae inventione'' (1541, [[Mainz]]) with the 23 letters. [[J]], [[U]] and [[W]] are missing.
  • 1553}}
ALPHABET USED TO WRITE THE LATIN LANGUAGE (MORE SPECIFIC THAN Q8229: LATIN ALPHABET)
Roman alphabet; Latin Alphabet; Latin-alphabet; Roman Alphabet; Latin (alphabet); Rome alphabet; Classical Latin alphabet; Early Latin alphabet; Abcdefghijklmnopqrstuvwxyz; Roman-alphabet; ABCDEFGHIJKLMNOPQRSTUVWXYZ; Old Latin alphabet
1) латинский алфавит
2) шрифт для латинских языков
Latin alphabet         
  • alt=Duenos inscription
  • shrine of the Augustales]] at [[Herculaneum]].
  • ''De chalcographiae inventione'' (1541, [[Mainz]]) with the 23 letters. [[J]], [[U]] and [[W]] are missing.
  • 1553}}
ALPHABET USED TO WRITE THE LATIN LANGUAGE (MORE SPECIFIC THAN Q8229: LATIN ALPHABET)
Roman alphabet; Latin Alphabet; Latin-alphabet; Roman Alphabet; Latin (alphabet); Rome alphabet; Classical Latin alphabet; Early Latin alphabet; Abcdefghijklmnopqrstuvwxyz; Roman-alphabet; ABCDEFGHIJKLMNOPQRSTUVWXYZ; Old Latin alphabet
1) латинский алфавит
2) шрифт для латинских языков
accepting state         
  • TTL]] counter, a type of state machine
  • Fig. 5: Representation of an acceptor; this example shows one that determines whether a binary number has an even number of 0s, where ''S''<sub>1</sub> is an ''accepting state'' and ''S''<sub>2</sub> is a ''non accepting state''.
  • Fig. 3 Example of a simple finite-state machine
  • Fig. 6 Transducer FSM: Moore model example
  • Fig. 7 Transducer FSM: Mealy model example
  • Fig. 4: Acceptor FSM: parsing the string "nice".
  • Fig. 2 SDL state machine example
  • A turnstile
  • State diagram for a turnstile
  • Fig. 1 UML state chart example (a toaster oven)
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser

математика

поглощающее состояние

finite element analysis         
  • A function in <math>H_0^1,</math> with zero values at the endpoints (blue), and a piecewise linear approximation (red)
  • (c) The computed solution, <math>u(x, y)=1-x^2-y^2.</math>
  • (b) The [[sparse matrix]] ''L'' of the discretized linear system
  • Solving the two-dimensional problem <math>u_{xx}+u_{yy}=-4</math> in the disk centered at the origin and radius 1, with zero boundary conditions.<br />(a) The triangulation.
  • url=https://ris.utwente.nl/ws/files/6153316/CMBBE2014-Hamid-Submitted.pdf}}</ref>
  • A piecewise linear function in two dimensions
  • alt=
  • alt=
NUMERICAL METHOD FOR SOLVING PHYSICAL OR ENGINEERING PROBLEMS
Finite element analysis; Finite Element Analysis; Finite elements; Finite element; Finite Element Method; Engineering treatment of the finite element method; Finite element solver; Finite element meshing; Finite element problem; Engineering treatment of the Finite Element Method; Finite element methods; Finite difference method based on variation principle; Finite elements analysis; Finite-element method; Finite-element analysis; Finite-element methods; Nonlinear finite element analysis

строительное дело

расчёт методом конечных элементов

Aramaic alphabet         
  • 70px
  • 42px
  • 21px
  • 19px
  • 53px
  • 40px
  • 13px
  • 53px
  • 19px
  • 53px
  • 49px
  • 34px
  • 38px
  • 34px
  • 21px
  • 15px
  • 43px
  • 47px
  • 17px
  • 13px
  • 17px
  • 47px
  • 18px
  • Mauryan]] emperor [[Ashoka]] at [[Kandahar]], [[Afghanistan]], 3rd century BC
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 16px
  • 20px
  • 21px
  • 18px
  • 19px
  • 18px
  • 18px
  • 18px
  • 17px
  • 18px
  • 21px
  • 20px
  • 21px
  • 18px
  • 17px
  • 18px
  • 17px
  • 15px
  • 17px
  • 17px
  • 18px
  • 15px
  • 18px
  • 18px
  • 18px
  • 18px
  • 20px
  • 20px
  • 20px
  • 20px
  • 20px
  • 20px
  • 20px
  • Proto-semiticI-01
  • 20px
  • 20px
  • 20px
  • 20px
  • 20px
  • Proto-semiticO-01
  • 20px
  • 20px
  • 20px
  • 20px
  • 20px
  • Proto-semiticTet-01
  • Proto-semiticTsade-01
  • Proto-semiticTsade-02
  • 20px
  • Proto-semiticX-01
  • Proto-semiticX-02
  • 20px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
  • One of the [[Tayma stones]]: a stele with dedicatory lapidary Aramaic inscription to the god Salm. Sandstone, 5th century BC. Found in [[Tayma]], [[Saudi Arabia]] by Charles Huber in 1884 and now in the [[Louvre]].
  • 18px
  • 18px
  • 18px
  • 18px
  • 18px
ABJAD
Maronite script; Jacobite script; Aramaic script; Aramean alphabet; Aramaean alphabet; Aramaic abjad; ISO 15924:Armi; 𐡗; Imperial Aramaic alphabet; Armi (script); Imperial Aramaic (script); Imperial Aramaic script; Ashurit writing; Aramean script
арамейский алфавит, арамейское письмо
finite state machine         
  • TTL]] counter, a type of state machine
  • Fig. 5: Representation of an acceptor; this example shows one that determines whether a binary number has an even number of 0s, where ''S''<sub>1</sub> is an ''accepting state'' and ''S''<sub>2</sub> is a ''non accepting state''.
  • Fig. 3 Example of a simple finite-state machine
  • Fig. 6 Transducer FSM: Moore model example
  • Fig. 7 Transducer FSM: Mealy model example
  • Fig. 4: Acceptor FSM: parsing the string "nice".
  • Fig. 2 SDL state machine example
  • A turnstile
  • State diagram for a turnstile
  • Fig. 1 UML state chart example (a toaster oven)
MATHEMATICAL MODEL OF COMPUTATION; ABSTRACT MACHINE THAT CAN BE IN EXACTLY ONE OF A FINITE NUMBER OF STATES AT ANY GIVEN TIME
Finite state machines; Finite state automaton; Finite automaton; Finite state automata; Start state; Finite automata; Deterministic automata; State machine; SFSM; Finite State Machine; Finate state automata; Accept state; Accepting state; State Machine; State machines; Recognizer; Recognizers; Sequence detector; Sequence detectors; Finite state acceptor; Finite State Automaton; State transition function; Finite State Machines; Finite-state automata; Finite-state automaton; Finite state machine; Finite state grammar; Finite-state machines; Finite state-machine; Finite state language; Finite state; Finite Automata; Finite state recognizer; Finite-state recognizer; State-machine; Acceptor (finite-state machine); Optimization of finite state machines; Recogniser

общая лексика

конечный автомат, КА

вычислительная модель, описывающая автомат с конечным числом состояний. Одно из них называется "начальным состоянием". Автомат переходит из одного состояния в другое под влиянием "управления", зависящего от внешних воздействий: получаемых сигналов или данных. Назначением каждого состояния является запоминание определённого момента истории системы. По типу управления КА делятся на детерминированные (находящиеся в каждый момент времени только в одном состоянии) и недетерминированные (могут одновременно находиться в нескольких состояниях). КА широко применяются в программировании, например в лексических анализаторах компиляторов

синоним

finite-state machine; FSM

Смотрите также

cumulative throughflow; fractional throughflow

Определение

Roman alphabet
The Roman alphabet is the alphabet that was used by the Romans in ancient times and that is used for writing most western European languages, including English.
N-SING: the N

Википедия

Point-finite collection

In mathematics, a collection or family U {\displaystyle {\mathcal {U}}} of subsets of a topological space X {\displaystyle X} is said to be point-finite if every point of X {\displaystyle X} lies in only finitely many members of U . {\displaystyle {\mathcal {U}}.}

A metacompact space is a topological space in which every open cover admits a point-finite open refinement. Every locally finite collection of subsets of a topological space is also point-finite. A topological space in which every open cover admits a locally finite open refinement is called a paracompact space. Every paracompact space is therefore metacompact.

Как переводится finite alphabet на Русский язык